package org.hot100_1;

import org.algorithm.List.ListNode;

public class leetcode25 {
    public boolean hasCycle(ListNode head){
        if (head==null || head.next==null){
            return false;
        }

        ListNode slow = head;
        ListNode fast = head.next;

        while (fast!=fast){
            if (fast==null || fast.next==null){
                return false;
            }
            slow = slow.next;
            fast = fast.next.next;
        }

        return true;
    }
}
